Memory Efficient Self-stabilizing Distance-k Independent Dominating Set Construction
نویسنده
چکیده
We propose a memory efficient self-stabilizing protocol building distance-k independent dominating sets. A distance-k independent dominating set is a distance-k independent set and a distance-k dominating set. Our algorithm, named SID, is silent; it converges under the unfair distributed scheduler (the weakest scheduling assumption). The protocol SID is memory efficient : it requires only log(2((n+1)(k+ 1))) bits per node. The correctness and the termination of the protocol SID is proven. The computation of the convergence time of the protocol SID is an opened question. keywords distributed algorithm, fault tolerance, self-stabilization, distance-k dominating set, distance-k independent set, distance-k independent dominating set, memory efficient
منابع مشابه
Memory Efficient Self-Stabilizing k-Independent Dominating Set Construction
We propose a memory efficient self-stabilizing protocol building k-independent dominating sets. A k-independent dominating set is a k-independent set and a kdominating set. A set of nodes, I, is k-independent if the distance between any pair of nodes in I is at least k + 1. A set of nodes, D, is a k-dominating if every node is within distance k of a node of D. Our algorithm, named SID, is silen...
متن کاملMemory efficient Self - Stabilizing k - Independent Dominating
We propose a memory efficient self-stabilizing protocol building k-independent dominating sets. A k-independent dominating set is a k-independent set and a kdominating set. A set of nodes, I, is k-independent if the distance between any pair of nodes in I is at least k + 1. A set of nodes, D, is a k-dominating if every node is within distance k of a node of D. Our algorithm, named SID, is silen...
متن کاملMemory efficient Self - Stabilizing k - Independent Dominating Set
We propose a memory efficient self-stabilizing protocol building k-independent dominating sets. A k-independent dominating set is a k-independent set and a kdominating set. A set of nodes, I, is k-independent if the distance between any pair of nodes in I is at least k + 1. A set of nodes, D, is a k-dominating if every node is within distance k of a node of D. Our algorithm, named SID, is silen...
متن کاملMemory efficient Self - Stabilizing k - Independant Dominating Set Construction ?
We propose a memory efficient self-stabilizing protocol building k-independant dominating sets. A k-independant dominating set is a k-independant set and a k-dominating set. A set of nodes, I, is kindependent if the distance between any pair of nodes in I is at least k + 1. A set of nodes, D, is a k-dominating if every node is within distance k of a node of D. Our algorithm, named SID, is silen...
متن کاملFast, silent self-stabilizing distance-k independent dominating set construction
We propose a fast, silent self-stabilizing protocol building a distance-k independent dominating set, named FID. The convergence of the protocol FID is established for any computation under the unfair distributed scheduler. The protocol FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size; it requires (k + 1)log(n + 1) bits per node. keyword...
متن کامل